internal/runtime/maps.Iter.m (field)

17 uses

	internal/runtime/maps (current package)
		table.go#L618: 	m    *Map
		table.go#L666: 	it.m = m
		table.go#L681: 	return it.m
		table.go#L726: 	entries := 1 << (it.m.globalDepth - it.tab.localDepth)
		table.go#L736: 	newKey, newElem, ok := it.m.getWithKey(it.typ, key)
		table.go#L761: 		if it.clearSeq == it.m.clearSeq && !it.typ.Key.Equal(key, key) {
		table.go#L784: 	if it.m == nil {
		table.go#L791: 	if it.m.writing != 0 {
		table.go#L815: 			grown := it.m.dirLen > 0
		table.go#L819: 				newKey, newElem, ok := it.m.getWithKey(it.typ, key)
		table.go#L822: 					if it.clearSeq == it.m.clearSeq && !it.typ.Key.Equal(key, key) {
		table.go#L851: 	if it.globalDepth != it.m.globalDepth {
		table.go#L881: 		orders := it.m.globalDepth - it.globalDepth
		table.go#L886: 		it.globalDepth = it.m.globalDepth
		table.go#L890: 	for ; it.dirIdx < it.m.dirLen; it.nextDirIdx() {
		table.go#L893: 			dirIdx := int((uint64(it.dirIdx) + it.dirOffset) & uint64(it.m.dirLen-1))
		table.go#L894: 			newTab := it.m.directoryAt(uintptr(dirIdx))